Transit Nodes - Lower Bounds and Refined Construction
نویسندگان
چکیده
We reconsider the concept of transit nodes as introduced by Bast et al. [3] and for the first time construct instance based lower bounds on the size of transit node sets by interpreting a LP formulation of the problem and its dual. As a side product we achieve considerably smaller access node sets which directly influences the query time for non-local queries.
منابع مشابه
Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks
The present paper examines the task of minimum cost flow finding in a fuzzy dynamic network with lower flow bounds. The distinguishing feature of this problem statement lies in the fuzzy nature of the network parameters, such as flow bounds, transmission costs and transit times. The arcs of the considered network have lower bounds. Another feature of this task is that fuzzy flow bounds, costs a...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستاره‌ای؛ مدل‌بندی، خطی‌سازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملSupplemental materials for “Close Lower and Upper Bounds for the Minimum Reticulate Network of Multiple Phylogenetic Trees”
Recall that non-binary nodes in N are nodes with out-degrees of three or more. Nodes with outdegrees of two are called binary nodes. Here, we describe some subtle issues on networks with non-binary nodes. Note that a non-binary node indicates uncertainty in branching order at this node. Only binary nodes exist in the “true” network: it is considered to be very unlikely to have two speciation ev...
متن کاملUniversal Packet Routing with Arbitrary Bandwidths and Transit Times
A fundamental problem in communication networks is store-andforward packet routing. In a celebrated paper Leighton, Maggs, and Rao [12] proved that the length of an optimal schedule is linear in the trivial lower bounds congestion and dilation. However, there has been no improvement on the actual bounds in more than 10 years. Also, commonly the problem is studied only in the setting of unit ban...
متن کاملHierarchical Clustering Given Confidence Intervals of Metric Distances
This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a resolution parameter, induced from the given distance intervals of the metric spaces. Our construction of hierarchical clustering methods is based on definin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012